Power Defaults ( preliminary report )
نویسنده
چکیده
We present a spectrum of default logics, using powerdomains to encode default constraints. The resulting non-monotonic entailment relations all satisfy the law of reasoning by cases. This result is a consequence of two general theorems valid for any Scott domain: the Di-chotomy Theorem and the Extension Splitting Theorem. We brieey indicate that for propositional logic, the complexity of entailment is complete for co-NP(3),
منابع مشابه
Dialectics and Speciicity: Conditioning in Logic-based Hypothetical Reasoning (preliminary Report)
In this paper we start with defaults as possible hypotheses and prediction as membership in all extensions. It is argued that this is too conservative and does not allow many intuitive answers. We show how viewing membership in all extensions as a form of di-alectic, and adding a notion of conditioning can produce more intuitive answers. Defaults are possible hypotheses for a logical argument t...
متن کاملDetermining Effect of Defaults on Grid Parity
Human activities emitting greenhouse gases (e.g. carbon dioxide) are the main cause of observed warming since the mid-20 th century. Because a large fraction of human emissions are from conventional power sources it will be important to adopt carbon neutral technologies such as alternative energy sources (IPCC, 2013). Grid parity is the point at which alternative energy sources reach a levelize...
متن کاملResults on Translating Defaults to Circumscription
In this paper we define different concepts, of translating a set of defaults into circumscription The most important of these-modular translation requires that the additive changes of specific facts (not defaults) of default theory translate to the additive changes of the simple abnormality theory (corresponding to circumscription). We show that, surprisingly enough, the important class of defa...
متن کاملAction Language BC: Preliminary Report
The action description languages B and C have significant common core. Nevertheless, some expressive possibilities of B are difficult or impossible to simulate in C, and the other way around. The main advantage of B is that it allows the user to give Prolog-style recursive definitions, which is important in applications. On the other hand, B solves the frame problem by incorporating the commons...
متن کاملModel-Preference Default Theories
Most formal theories of default inference have very poor computational properties, and are easily shown to be intractable, or worse, undecidable. We are therefore investigating limited but efficiently computable theories of default reasoning. This paper defines systems of Propositional Model-Preference Defaults, which provide a true modeltheoretic account of default inference with exceptions. T...
متن کامل